欧美含羞草免费观看全部完,两个人看的www免费高清观看

TranslationMobile

最低成本路徑

"minimum" in Chinese : n. (pl. minimums, -ma ) 最小，最 ...
"cost" in Chinese : n. 1.費(fèi)用；代價(jià)，價(jià)格；成本。 2.犧牲；損害，損失 ...
"path" in Chinese : n. (pl. paths ) 1.(自然踏成的)路；路 ...
"cost，minimum" in Chinese : 最低成本
"minimum cost" in Chinese : 最小代價(jià), 最低成本
"minimum distance rectangular path" in Chinese : 最小距離直角通路
"minimum energy path" in Chinese : 最低能量途徑
"minimum hop path" in Chinese : 最小跳步通路
"minimum path algorithm" in Chinese : 最短路徑法
"minimum path cover" in Chinese : 最小路徑覆蓋
"minimum path network" in Chinese : 最短路網(wǎng)
"minimum path vine" in Chinese : 最短路徑蔓
"minimum path-length algorithm" in Chinese : 最短通路算法; 最小通路算法
"minimum time path" in Chinese : 最短時(shí)程; 最速降線; 最小時(shí)程
"minimum turning path" in Chinese : 最小轉(zhuǎn)彎軌跡

Examples

After analysis of existing heuristic , four new heuristics for solve steiner problem which are kbmph ( key - node based minimum cost paths heuristic ) algorithm , kbmph , algorithm , kddmc ( key - node and destination driven multicast routing ) algorithm and wddmc ( weighted destination driven multicast routing ) algorithm are presented
在分析比較了已有的典型的啟發(fā)式算法基礎(chǔ)上，提出了四種steiner樹的啟發(fā)式算法： kbmph算法、 kbmph _ 1算法、 kddmc算法和wddmc算法。
One of constrained problem is delay constrained steiner tree problem . a heuristic dbma ( delay - bounded multicast routing algorithm ) based on minimum delay path set and minimum cost path set is proposed . simulation result demonstrate that it is a delay constrained algorithm with low time complexity and low cost
首先是時(shí)延約束的最小steiner樹問題，在比較了現(xiàn)有的算法以后，提出了一種基于最短時(shí)延路徑集和最小費(fèi)用路徑集的多播路由算法? ? dbma算法，仿真結(jié)果表明該算法是一種低復(fù)雜度的時(shí)延約束低費(fèi)用多播路由算法。
The delay and delay variation constrained minimum steiner tree problem is also researched . lcdvma ( low - cost delay variation - constrained multicast algorithm ) is proposed for this problem . low time complexity , low cost and constrained delay and low delay variation are achieved by only comparing minimum delay paths and minimum cost paths
對(duì)于時(shí)延和時(shí)延差約束的最小steiner樹問題，提出了一種基于最小時(shí)延路徑和最小費(fèi)用路徑的算法?一lcdvma算法，由于該算法比較了通過中轉(zhuǎn)節(jié)點(diǎn)后的最低費(fèi)用路徑和最短時(shí)延路徑，降低了運(yùn)算復(fù)雜度，通過仿真得到了較小的網(wǎng)絡(luò)費(fèi)用和時(shí)延差，因此lcdvma算法是一種具有低復(fù)雜度的時(shí)延和時(shí)延差約束的最小steiner樹的啟發(fā)式算法。